Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
نویسندگان
چکیده
منابع مشابه
Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
We consider a generalisation of the hidden number problem recently introduced by Boneh and Venkatesan. The initial problem can be stated as follows: recover a number a ∈ Fp such that for many known random t ∈ Fp approximations to the values of batcp are known. Here we study a version of the problem where the “multipliers” t are not known but rather certain approximations to them are given. We p...
متن کاملThe Multivariate Hidden Number Problem
This work extends the line of research on the hidden number problem. Motivated by studying bit security in finite fields, we define the multivariate hidden number problem. Here, the secret and the multiplier are vectors, and partial information about their dot product is given. Using tools from discrete Fourier analysis introduced by Akavia, Goldwasser and Safra, we show that if one can find th...
متن کاملTime-lock puzzles and timed-release Crypto
Our motivation is the notion of \timed-release crypto," where the goal is to encrypt a message so that it can not be decrypted by anyone, not even the sender, until a pre-determined amount of time has passed. The goal is to \send information into the future." This problem was rst discussed by Timothy May [6]. What are the applications of \timed-release crypto"? Here are a few possibilities (som...
متن کاملOn the modular inversion hidden number problem
We give a rigorous deterministic polynomial time algorithm for the modular inversion hidden number problem introduced by D. Boneh, S. Halevi and N. A. Howgrave-Graham in 2001. For our algorithm we need to be given about 2/3 of the bits of the output, which matches one of the heuristic algorithms of D. Boneh, S. Halevi and N. A. Howgrave-Graham and answers one of their open questions. However th...
متن کاملA hidden number problem in small subgroups
Boneh and Venkatesan have proposed a polynomial time algorithm for recovering a hidden element α ∈ Fp, where p is prime, from rather short strings of the most significant bits of the residue of αt modulo p for several randomly chosen t ∈ Fp. González Vasco and the first author have recently extended this result to subgroups of Fp of order at least p 1/3+ε for all p and to subgroups of order at ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2003
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-03-01495-9